Demultiplexed architectures: a solution for efficient STREAMS-based communication stacks
نویسندگان
چکیده
منابع مشابه
MIMO Architectures for Efficient Communication in Space
The characteristics of a space-to-space multipleinput, multiple-output (MIMO) communication channel that distinguish it from terrestrial MIMO communication channels are summarized and discussed primarily from an informationtheoretic viewpoint. The implications of these characteristics for the design and application of future space-based communication systems are also discussed, and it is shown ...
متن کاملStreamline: Efficient OS Communication Through Versatile Streams
Streamline is a stream-based communication subsystem that spans from embedded hardware to userspace processes. It improves performance of memory and I/O bound applications by constructing tailor-made datapaths for each application at runtime. Datapath optimisation removes unnecessary copying, context switching and cache replacement. It simplifies integration of embedded and distributed hardware...
متن کاملCommunication architectures for web-based telerobotic systems
Controlling robotic devices from remote places, using an existing, wide spread network is significantly extend their application. Internet, considering its wide spread and accessibility, is and ideal media for data transmission between a robot and its operator, but the limitation in bandwidth, the notable delay, and the unreliability of the network introduces several problems. Proposals for com...
متن کاملEfficient Synchronization and Coherence for Nonuniform Communication Architectures
Nonuniformity is a common characteristic of contemporary computer systems, mainly because of physical distances in computer designs. In large multiprocessors, the access to shared memory is often nonuniform, and may vary as much as ten times for some nonuniform memory access (NUMA) architectures, depending on if the memory is close to the requesting processor or not. Much research has been devo...
متن کاملAn Efficient and Fair Solution for Communication Graph Games
We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of this component in the game itself to the total payoff of these players when applying the solution to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Network
سال: 1997
ISSN: 0890-8044
DOI: 10.1109/65.598456